Top-K Shortest Paths in Large Typed RDF Datasets Challenge
نویسندگان
چکیده
Perhaps the most widely appreciated linked data principle is the one that instructs linked data providers to provide useful information using the standards (i.e., RDF and SPARQL). Such information corresponds to patterns expressed as SPARQL queries that are matched against the RDF graph. Until recently, it was not possible to create a pattern without specifying the exact path that would match against the underlying graph. The advent of the SPARQL 1.1 Recommendation introduced property paths as a new graph matching paradigm that allows the employment of Kleene star * (and its variant Kleene plus +) unary operators to build SPARQL queries that are agnostic of the underlying RDF graph structure. In this paper, we present the Top-k Shortest Paths in large typed RDF Datasets Challenge the highlights the key aspects of property path queries that employ the Kleene star operator.
منابع مشابه
Path Query Processing on Very Large RDF Graphs
Finding the shortest path between two nodes in an RDF graph is a fundamental operation that allows to discover complex relationships between entities. In this paper we consider the path queries over graphs from a database perspective. We provide the full-fledge database solution to execute path queries over very large RDF graphs. We present low-level techniques to speed-up shortest paths algori...
متن کاملA Formal Graph Model for RDF and Its Implementation
Formalizing an RDF abstract graph model to be compatible with the RDF formal semantics has remained one of the foundational problems in the Semantic Web. In this paper, we propose a new formal graph model for RDF datasets. This model allows us to express the current model-theoretic semantics in the form of a graph. We also propose the concepts of resource path and triple path as well as an algo...
متن کاملUsing Triple Pattern Fragments to Enable Streaming of Top-k Shortest Paths via the Web
Searching for relationships between Linked Data resources is typically interpreted as a pathfinding problem: looking for chains of intermediary nodes (hops) forming the connection or bridge between these resources in a single dataset or across multiple datasets. In many cases centralizing all needed linked data in a certain (specialized) repository or index to be able to run the algorithm is no...
متن کاملEfficiently Computing Top-K Shortest Path Join
Driven by many applications, in this paper we study the problem of computing the top-k shortest paths from one set of target nodes to another set of target nodes in a graph, namely the top-k shortest path join (KPJ) between two sets of target nodes. While KPJ is an extension of the problem of computing the top-k shortest paths (KSP) between two target nodes, the existing technique by converting...
متن کاملTop-K Possible Shortest Path Query over a Large Uncertain Graph
This paper studies the top-k possible shortest path (kSP) queries in a large uncertain graph, specifically, given two vertices S and T , a kSP query reports the top-k possible shortest paths from S to T . Different from existing solutions for uncertain graph problems, we adopt the possible worlds semantics. Although possible worlds semantics have been studied widely in relational databases, the...
متن کامل